Deterministic finite automaton

Results: 142



#Item
121Conjunctive Queries for EL with Role Composition Markus Krötzsch and Sebastian Rudolph Institute AIFB, Universität Karlsruhe, Germany {mak|sru}@aifb.uni-karlsruhe.de  Abstract. EL++ is a rather expressive description l

Conjunctive Queries for EL with Role Composition Markus Krötzsch and Sebastian Rudolph Institute AIFB, Universität Karlsruhe, Germany {mak|sru}@aifb.uni-karlsruhe.de Abstract. EL++ is a rather expressive description l

Add to Reading List

Source URL: www.ceur-ws.org

Language: English - Date: 2007-05-22 01:39:22
122Decidability of Bisimulation Equivalence for Pushdown Processes Colin Stirling Division of Informatics University of Edinburgh Edinburgh EH9 3JZ, UK

Decidability of Bisimulation Equivalence for Pushdown Processes Colin Stirling Division of Informatics University of Edinburgh Edinburgh EH9 3JZ, UK

Add to Reading List

Source URL: homepages.inf.ed.ac.uk

Language: English - Date: 2009-05-20 09:59:44
123Data Structures in Coco/R Hanspeter Mössenböck Johannes Kepler University Linz Institute of System Software April 2005 This technical note describes the data structures in the C# and Java implementations

Data Structures in Coco/R Hanspeter Mössenböck Johannes Kepler University Linz Institute of System Software April 2005 This technical note describes the data structures in the C# and Java implementations

Add to Reading List

Source URL: www.ssw.uni-linz.ac.at

Language: English - Date: 2005-04-26 10:03:24
124Tree-Walking Automata Do Not Recognize All Regular Languages Mikolaj Bojanczyk

Tree-Walking Automata Do Not Recognize All Regular Languages Mikolaj Bojanczyk

Add to Reading List

Source URL: www.mimuw.edu.pl

Language: English - Date: 2011-11-07 04:39:25
1251 Pushdown Automata Hendrik Jan Hoogeboom and Joost Engelfriet

1 Pushdown Automata Hendrik Jan Hoogeboom and Joost Engelfriet

Add to Reading List

Source URL: www.liacs.nl

Language: English - Date: 2004-05-10 11:22:35
126Non-deterministic pushdown automata Regular languages are recognized by finite automata, context free languages are recognized by non-deterministic pushdown automata.

Non-deterministic pushdown automata Regular languages are recognized by finite automata, context free languages are recognized by non-deterministic pushdown automata.

Add to Reading List

Source URL: www.cs.ox.ac.uk

Language: English - Date: 2012-01-14 04:37:24
127IEEE TRANSACTIONS ON  SYSTEMS, MAN, AND CYBERNETICS, VOL. SMC-4, NO. 4, JULY 1974

IEEE TRANSACTIONS ON SYSTEMS, MAN, AND CYBERNETICS, VOL. SMC-4, NO. 4, JULY 1974

Add to Reading List

Source URL: www.dklevine.com

Language: English - Date: 2010-12-10 19:21:29
128Chapter 3 Pushdown Automata and Context Free Languages

Chapter 3 Pushdown Automata and Context Free Languages

Add to Reading List

Source URL: www.cs.nyu.edu

Language: English - Date: 2009-10-01 15:20:36
129CHAPTER  ✦

CHAPTER ✦

Add to Reading List

Source URL: infolab.stanford.edu

Language: English - Date: 2008-09-18 21:43:57
130Free University of Bolzano–Formal Languages and Compilers. Lecture IV, [removed] – A.Artale  Formal Languages and Compilers

Free University of Bolzano–Formal Languages and Compilers. Lecture IV, [removed] – A.Artale Formal Languages and Compilers

Add to Reading List

Source URL: www.inf.unibz.it

Language: English - Date: 2012-10-18 11:15:06